#include "BinarySearchTree.h"
int main(int argc,char *argv[])
{
   BinaryTree<double> A;
   A.rbinsert(16.0);
   A.rbinsert(8.0);
   A.rbinsert(24.0);
   A.rbinsert(4.0);
   A.inorder_walk();
   std::cout << A.tree_search(16.0)->color <<"\n";
   std::cout << A.tree_search(4.0)->color  <<"\n";
   std::cout << A.tree_search(8.0)->color  <<"\n";
   A.rbdel(A.tree_search(8.0));
   A.inorder_walk();
   std::cout << A.tree_search(4.0)->color  <<"\n";
   return 0;
}
